A Mobile Sink-initiated Proactive Routing Protocol for Deadline-Aware Data Aggregation Method in Energy-Efficient Wireless Sensor Networks
نویسندگان
چکیده
In this paper, we focus on monitoring environments with wireless sensor networks in which mobile sink nodes traverse sensing fields in a specific spatialtemporal manner and aggregate various types of environmental data with different deadline constraints distributed over sensor nodes. For such environments, we propose an energy-efficient data aggregation method that reduces intermediate transmission in multi-hop communication while guaranteeing predetermined deadlines. The basic approach of the proposed method is to temporarily gather (or buffer) the observed data into several sensor nodes around the moving path of the mobile sink that would meet their deadlines at the next visit. Then, the buffered data is transferred to the mobile sink node when it visits the buffering nodes. We also propose a mobile sink-initiated proactive routing protocol with low cost (MIPR-LC) that efficiently constructs routes to the buffering nodes on each sensor node. Moreover, we simulate the proposed aggregation method and routing protocol to show their effectiveness. Our results confirm that the MIPR-LC method can reduce energy consumption by up to 23% when compared with a simple routing protocol. In addition, the mobile sink nodes can gather almost all of the observed data within the deadline.
منابع مشابه
An Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...
متن کاملEEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks
Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملSTCS-GAF: Spatio-Temporal Compressive Sensing in Wireless Sensor Networks- A GAF-Based Approach
Routing and data aggregation are two important techniques for reducing communication cost of wireless sensor networks (WSNs). To minimize communication cost, routing methods can be merged with data aggregation techniques. Compressive sensing (CS) is one of the effective techniques for aggregating network data, which can reduce the cost of communication by reducing the amount of routed data to t...
متن کاملEEQR: An Energy Efficient Query-Based Routing Protocol for Wireless Sensor Networks
Routing in Wireless Sensor Networks (WSNs) is a very challenging task due to the large number of nodes, their mobility and lack of proper infrastructure. Since the sensors are battery powered devices, energy efficiency is considered as one of the main factors in designing routing protocols in WSNs. Most of energy-aware routing protocols are mere energy savers that attempt to decrease the energy...
متن کامل